Golden Reference-Free Hardware Trojan Localization Using Graph Convolutional Network

نویسندگان

چکیده

The globalization of the integrated circuit (IC) supply chain has moved most design, fabrication, and testing process from a single trusted entity to various untrusted third-party entities worldwide. risk using third-Party Intellectual Property (3PIP) is possibility for adversaries insert malicious modifications known as Hardware Trojans (HTs). These HTs can compromise integrity, deteriorate performance, deny service, alter functionality design. While numerous HT detection methods have been proposed in literature, crucial task localization overlooked. Moreover, few existing several weaknesses: reliance on golden reference, inability generalize all types HT, lack scalability, low resolution, manual feature engineering/property definition. To overcome their shortcomings, we propose novel, reference-free method at pre-silicon stage by leveraging graph convolutional network (GCN). In this work, convert design into its intrinsic data structure, graph, extract node attributes. Afterward, convolution performs automatic extraction nodes classify Trojan or benign. Our approach automated does not burden designer with code review. It locates signals 99.6% accuracy, 93.1% $F1$ -score, false-positive rate below 0.009%.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph Based Convolutional Neural Network

In this paper we present a method for the application of Convolutional Neural Network (CNN) operators for use in domains which exhibit irregular spatial geometry by use of the spectral domain of a graph Laplacian, Figure 1. This allows learning of localized features in irregular domains by defining neighborhood relationships as edge weights between vertices in graph G. By formulating the domain...

متن کامل

Tensor graph convolutional neural network

In this paper, we propose a novel tensor graph convolutional neural network (TGCNN) to conduct convolution on factorizable graphs, for which here two types of problems are focused, one is sequential dynamic graphs and the other is cross-attribute graphs. Especially, we propose a graph preserving layer to memorize salient nodes of those factorized subgraphs, i.e. cross graph convolution and grap...

متن کامل

Hardware Trojan vulnerability

Many basic analog blocks and structures, which contain positive feedback loops, are vulnerable to the presence of one or more undesired stable equilibrium points. The phenomena of multiple equilibrium points is investigated with emphasis on using a temperature-domain representation to identify equilibrium points in some circuits that have a single positive feedback loop. By example, it is shown...

متن کامل

Improve range-free localization accuracy in wireless sensor network using DV-hop and zoning

In recent years, wireless sensor networks have drawn great attention. This type of network is composed of a large number of sensor nodes which are able to sense, process and communicate. Besides, they are used in various fields such as emergency relief in disasters, monitoring the environment, military affairs and etc. Sensor nodes collect environmental data by using their sensors and send them...

متن کامل

Multi-Speaker Localization Using Convolutional Neural Network Trained with Noise

The problem of multi-speaker localization is formulated as a multi-class multi-label classification problem, which is solved using a convolutional neural network (CNN) based source localization method. Utilizing the common assumption of disjoint speaker activities, we propose a novel method to train the CNN using synthesized noise signals. The proposed localization method is evaluated for two s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Very Large Scale Integration Systems

سال: 2022

ISSN: ['1063-8210', '1557-9999']

DOI: https://doi.org/10.1109/tvlsi.2022.3191683